MIC 2003 : The Fifth Metaheuristics International Conference 90 - 1 Backbone Guided Local Search for the Traveling Salesman ∗
نویسندگان
چکیده
The Traveling Salesman Problem (TSP) is a well-known optimization problem with many real-world applications [4]. In this problem, one tries to find a minimal-cost tour visiting each of the given cities exactly once. Since the TSP is NP-hard, much research has concentrated on finding good approximate solutions. One class of heuristic algorithms is local search, which has been routinely applied to large and difficult problems in practice. Although local search cannot guarantee the optimality of its solutions, it is among the best algorithm for the TSP. The best known, and perhaps oldest, local search algorithm is the Lin-Kernighan algorithm for the TSP [9]. Since its inception almost three decades ago, this classic optimization algorithm has inspired much research on local search. Today, the LinKernighan algorithm and its variants, such as iterated Lin-Kernighan [6, 7] and Helsgaun’s variant [5], are still among the best algorithms for the TSP, producing results often within one percent of optimal.
منابع مشابه
2 ND INTERNATIONAL CONFERENCE ON METAHEURISTICS - MIC 97 1 Guided Local Search for the Vehicle Routing
متن کامل
2 Nd International Conference on Metaheuristics - Mic 97 32
In this paper we present an extension of MAX{MIN Ant System applying it to Traveling Salesman Problems and Quadratic Assignment Problems. The extension involves the use of a modiied choice rule and a hybrid scheme allowing ants to improve their solution by local search. The computational results show that this algorithm can be used to eeciently nd near optimal solutions to hard combinatorial op...
متن کاملA New Cooperative Framework for Parallel Trajectory-Based Metaheuristics
In this paper, we propose the Parallel Elite Biased framework (PEB framework) for parallel trajectory-based metaheuristics. In the PEB framework, multiple search processes are executed concurrently. During the search, each process sends its best found solutions to its neighboring processes and uses the received solutions to guide its search. Using the PEB framework, we design a parallel variant...
متن کاملRandom gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003